On Transfinite Knuth-Bendix Orders
نویسندگان
چکیده
In this paper we discuss the recently introduced transfinite Knuth-Bendix orders. We prove that any such order with finite subterm coefficients and for a finite signature is equivalent to an order using ordinals below ω, that is, finite sequences of natural numbers of a fixed length. We show that this result does not hold when subterm coefficients are infinite. However, we prove that in this general case ordinals below ω ω suffice. We also prove that both upper bounds are tight. We briefly discuss the significance of our results for the implementation of firstorder theorem provers and describe relationships between the transfinite Knuth-Bendix orders and existing implementations of extensions of the Knuth-Bendix orders.
منابع مشابه
A Transfinite Knuth-Bendix Order for Lambda-Free Higher-Order Terms
We generalize the Knuth–Bendix order (KBO) to higher-order terms without λ-abstraction. The restriction of this new order to first-order terms coincides with the traditional KBO. The order has many useful properties, including transitivity, the subterm property, compatibility with contexts (monotonicity), stability under substitution, and well-foundedness. Transfinite weights and argument coeff...
متن کاملAn AC-Compatible Knuth-Bendix Order
We introduce a family of AC-compatible Knuth-Bendix simplification orders which are AC-total on ground terms. Our orders preserve attractive features of the original Knuth-Bendix orders such as existence of a polynomial-time algorithm for comparing terms; computationally efficient approximations, for instance comparing weights of terms; and preference of light terms over heavy ones. This makes ...
متن کاملKnuth-Bendix Completion with a Termination Checker
Knuth-Bendix completion takes as input a set of universal equations and attempts to generate a convergent rewriting system with the same equational theory. An essential parameter is a reduction order used at runtime to ensure termination of intermediate rewriting systems. Any reduction order can be used in principle, but modern completion tools typically implement only a few classes of such ord...
متن کاملFormalizing Knuth-Bendix Orders and Knuth-Bendix Completion
We present extensions of our Isabelle Formalization of Rewriting that cover two historically related concepts: the Knuth-Bendix order and the Knuth-Bendix completion procedure. The former, besides being the first development of its kind in a proof assistant, is based on a generalized version of the Knuth-Bendix order. We compare our version to variants from the literature and show all propertie...
متن کاملRecursively Deened Quasi Orders on Terms
We study the problems involved in the recursive de nition of (quasi) orders on terms, focussing on the question of establishing well-de nedness, and the properties required for partial and quasi-orders: irre exivity and transitivity, and re exivity and transitivity, respectively. These properties are in general di cult to establish and this has in many cases come down in the literature as folkl...
متن کامل